Research on a new information fusion method based on SVM and SCQPSO and its application

نویسندگان

  • Wu Deng
  • Xinhua Yang
  • Huimin Zhao
  • Li Zou
  • Zhengguang Li
  • Wen Li
چکیده

The optimal parameters of the support vector machine (SVM) are very important for accuracy modeling and generalization performance. The quantum particle swarm optimization (QPSO) algorithm takes on the characteristics of the rapid global optimization, scale chaos method provides the characteristics of the fast convergence and the SVM has the characteristics of the nonlinear fitting. These advantages of the scale chaos method and the QPSO algorithm are used to propose a scale chaos QPSO (SCQPSO) algorithm. Then the SCQPSO algorithm is used to optimize the parameters of the SVM model. A new information fusion method based the SCQPSO algorithm and the SVM model (SCQPSO-SVM) is proposed in this paper. The SCQPSO-SVM algorithm uses the global optimization ability of the SCQPSO algorithm to comprehensively optimize the penalty coefficient, kernel parameter and hybrid weight of the SVM model. The goal is to improve the solved speed and solution accuracy of the SVM model. The SCQPSO-SVM algorithm is applied in the testing function and the rotor fault diagnosis of traction motor. The experimental results show that the SCQPSO algorithm can search for the good optimization results and the SCQPSO-SVM algorithm can reduce the error rate of the fusion recognition. So the SCQPSO-SVM algorithm takes on better generalization performance and prediction accuracy in the real application.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developing a New Method in Object Based Classification to Updating Large Scale Maps with Emphasis on Building Feature

According to the cities expansion, updating urban maps for urban planning is important and its effectiveness is depend on the information extraction / change detection accuracy. Information extraction methods are divided into two groups, including Pixel-Based (PB) and Object-Based (OB). OB analysis has overcome the limitations of PB analysis (producing salt-pepper results and features with hole...

متن کامل

A novel ranking method for intuitionistic fuzzy set based on information fusion and application to threat assessment

A novel ranking method based on multi-time information fusion is proposed for intuitionistic fuzzy sets (IFSs) and applied to the threat assessment problem, a multi-attribute decision making (MADM) one. This method integrates a designed intuitionistic fuzzy entropy (IFE), the closeness degree of technique for order preference by similarity to ideal solution (TOPSIS), the decision maker¡¯s (DM¡¯...

متن کامل

A fuzzy reasoning method based on compensating operation and its application to fuzzy systems

In this paper, we present a new fuzzy reasoning method based on the compensating fuzzy reasoning (CFR). Its basicidea is to obtain a new fuzzy reasoning result by moving and deforming the consequent fuzzy set on the basis of themoving, deformation, and moving-deformation operations between the antecedent fuzzy set and observation information.Experimental results on real-world data sets show tha...

متن کامل

A multi agent method for cell formation with uncertain situation, based on information theory

This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...

متن کامل

A new method for accelerating impossible differential cryptanalysis and its application on LBlock

Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014